FATODE: A Library for Forward, Adjoint, and Tangent Linear Integration of ODEs

نویسندگان

  • Hong Zhang
  • Adrian Sandu
چکیده

Fatode is a fortran library for the integration of ordinary differential equations with direct and adjoint sensitivity analysis capabilities. The paper describes the capabilities, implementation, code organization, and usage of this package. Fatode implements four families of methods – explicit Runge-Kutta for nonstiff problems and fully implicit Runge-Kutta, singly diagonally implicit Runge-Kutta, and Rosenbrock for stiff problems. Each family contains several methods with different orders of accuracy; users can add new methods by simply providing their coefficients. For each family the forward, adjoint, and tangent linear models are implemented. General purpose solvers for dense and sparse linear algebra are used; users can easily incorporate problem-tailored linear algebra routines. The performance of the package is demonstrated on several test problems. To the best of our knowledge fatode is the first publicly available general purpose package that offers forward and adjoint sensitivity analysis capabilities in the context of Runge Kutta methods. A wide range of applications are expected to benefit from its use; examples include parameter estimation, data assimilation, optimal control, and uncertainty quantification.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FATODE: a library for forward, adjoint and tangent linear integration of stiff systems

The FATODE, which is extracted from the KPP numerical libraray, is a Fortran programming library for the integration of stiff ODE systems. It incorporates a set of generic linear solvers suitable for large sparse systems. And the set allows users to add their own implementation conveniently. FATODE contains three families of methods – fully implicit Runge-Kutta methods, SDIRK methods and Rosenb...

متن کامل

Forward and adjoint sensitivity analysis with continuous explicit Runge - Kutta methods ⋆

We study the numerical solution of tangent linear, first, and second order adjoint models with high-order explicit, continuous Runge-Kutta methods. The approaches currently implemented in popular packages such as SUNDIALS or DASPKADJOINT are based on linear multistep methods. For adaptive time integration of nonlinear models, interpolation of the forward model solution is required during the ad...

متن کامل

Forward, Tangent Linear, and Adjoint Runge-Kutta Methods in KPP-2.2

This paper presents the new stiff solvers of the new version 2.2 of the Kinetic PreProcessor (KPP). Taking a set of chemical reactions and their rate coefficients as input, KPP generates Fortran90, Fortran77, Matlab, or C code for the temporal integration of the kinetic system. Efficiency is obtained by carefully exploiting the sparsity structures of the Jacobian and of the Hessian. A set of in...

متن کامل

Forward, Tangent Linear, and Adjoint Runge Kutta Methods in KPP–2.2 for Efficient Chemical Kinetic Simulations

The Kinetic PreProcessor (KPP) is a widely used software environment which generates Fortran90, Fortran77, Matlab, or C code for the simulation of chemical kinetic systems. High computational efficiency is attained by exploiting the sparsity pattern of the Jacobian and Hessian. In this paper we report on the implementation of two new families of stiff numerical integrators in the new version 2....

متن کامل

Forward, tangent linear, and adjoint Runge-Kutta methods for stiff chemical kinetic simulations

This paper investigates numerical methods for direct decoupled sensitivity and discrete adjoint sensitivity analysis of stiff systems based on implicit Runge Kutta schemes. Efficient implementations of tangent linear and adjoint schemes are discussed for two families of methods: fully implicit three-stage Runge Kutta and singly diagonally-implicit Runge Kutta. High computational efficiency is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2014